SAT COMPETITION 2017 Solver and Benchmark Descriptions
نویسندگان
چکیده
We improve abcdSAT by a new various scoring Scheme. AbcdSAT is a SAT solver built on the top of Glucose 2.3 [5]. The existing Glucose has no inprocess. Nevertheless, here we add various inprocesses to AbcdSAT. According to the rule of different tracks at the SAT Competition 2017, we develop multple versions of abcdSAT, which are submitted to agile, main, no-limit, incremental library and parallel track.
منابع مشابه
Solver and Benchmark Descriptions
We improve abcdSAT by a new various scoring Scheme. AbcdSAT is a SAT solver built on the top of Glucose 2.3 [5]. The existing Glucose has no inprocess. Nevertheless, here we add various inprocesses to AbcdSAT. According to the rule of different tracks at the SAT Competition 2017, we develop multple versions of abcdSAT, which are submitted to agile, main, no-limit, incremental library and parall...
متن کاملThe Configurable SAT Solver Challenge (CSSC)
It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances. In the international SAT competition series, these parameters are ignored: solvers are run using a s...
متن کاملCADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017
This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...
متن کاملNew Features of the SAT’04 versions of zChaff
Zchaff is an implementation of the well known Chaff algorithm [6]. It participated in the SAT 2002 Competition and won the Best Complete Solver in both industrial and handmade benchmark categories. It is a popular solver and can be compiled into a linkable library for easy integration with user applications. Successful integration examples include the BlackBox AI planner [1], NuSMV model checke...
متن کاملHordeSat: A Massively Parallel Portfolio SAT Solver
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017